hashed array tree造句

例句与造句

1. Hashed Array Tree ( HAT ) is a dynamic array algorithm published by Sitarski in 1996.
2. Brodnik et al . presented a dynamic array algorithm with a similar space wastage profile to hashed array trees.
3. The algorithm has O ( 1 ) amortized performance when appending a series of objects to the end of a Hashed Array Tree.
4. Whereas simple dynamic arrays based on array, hashed array trees waste only order " O " ( ) storage space.
5. The algorithm has O ( 1 ) amortized performance when appending a series of objects to the end of a hashed array tree.
6. It's difficult to find hashed array tree in a sentence. 用hashed array tree造句挺难的
7. Brodnik's implementation retains previously allocated leaf arrays, with a more complicated address calculation function as compared to hashed array trees.
8. Hashed Array Tree wastes order n 1 / 2 amount of storage space, where n is the number of elements in the array.
9. When a hashed array tree is full, its directory and leaves must be restructured to twice their prior size to accommodate additional append operations.
10. There are multiple alternatives for reducing size : when a Hashed Array Tree is one eighth full, it can be restructured to a smaller, half-full hashed array tree; another option is only freeing unused leaf arrays, without resizing the leaves.
11. There are multiple alternatives for reducing size : when a Hashed Array Tree is one eighth full, it can be restructured to a smaller, half-full hashed array tree; another option is only freeing unused leaf arrays, without resizing the leaves.